/*
 * Copyright (c) 2012, Markus Weber All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without modification, are
 * permitted provided that the following conditions are met:
 * 
 * Redistributions of source code must retain the above copyright notice, this list of
 * conditions and the following disclaimer. Redistributions in binary form must reproduce the
 * above copyright notice, this list of conditions and the following disclaimer in the
 * documentation and/or other materials provided with the distribution.
 * 
 * Neither the name of the author nor the names of its contributors may be used to endorse or
 * promote products derived from this software without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS
 * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
 * TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 * 
 */
package de.dfki.graph;
import java.lang.reflect.Array;
import java.lang.reflect.GenericArrayType;
import java.lang.reflect.ParameterizedType;
import java.lang.reflect.Type;
import java.util.HashMap;
import java.util.Map;

import org.jgrapht.graph.DefaultEdge;

/**
 * Labeled edge
 *
 * @author Markus Weber
 */
public class LabeledEdge<T extends LabelType<?>> extends DefaultEdge {

    /**
     * Serial id.
     */
    private static final long serialVersionUID = -3443441499843222807L;
    /**
     * Label for the edge.
     */
    private T label;
    /**
     * List of attributes
     */
    private Map<String, String> attributes = new HashMap<String, String>();

    /**
     * Default constructor for EgdeFactory
     */
    public LabeledEdge() {
        super();
    }

    /**
     * Creates a edge between two entities.
     *
     * @param label
     */
    public LabeledEdge(T label) {
        this.label = label;
    }

    @Override
    public String toString() {
        return "[source=" + this.getSource() + " --" + this.getLabel() + "--> target=" + getTarget();
    }

    /**
     * Returns the label
     *
     * @return
     */
    public T getLabel() {
        return label;
    }

    /**
     * Sets the label
     *
     * @param label
     */
    public void setLabel(T label) {
        this.label = label;
    }

    /**
     * Returns the attribute map
     *
     * @return
     */
    public final Map<String, String> getAttributes() {
        return attributes;
    }

    /**
     * Adds an attribute.
     *
     * @param attribute
     * @param value
     */
    public void addAttribute(final String attribute, final String value) {
        this.attributes.put(attribute, value);
    }

    /**
     * Returns the value for an attribute.
     *
     * @param attribute
     * @return
     */
    public String getAttribute(final String attribute) {
        return this.attributes.get(attribute);
    }
}
